Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("PLESNIK J")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 16 of 16

  • Page / 1
Export

Selection :

  • and

THE NP-COMPLETENESS OF THE HAMILTONIAN CYCLE PROBLEM IN PLANAR DIGRAPHS WITH DEGREE BOUND TOPLESNIK J.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 199-201; BIBL. 7 REF.Article

CONNECTIVITY OF REGULAR GRAPHS AND THE EXISTENCE OF 1-FACTORSPLESNIK J.1972; MAT. CAS.; CESKOSL.; DA. 1972; VOL. 22; NO 4; PP. 310-318; BIBL. 6 REF.Serial Issue

COMPLEXITY OF DECOMPOSING GRAPHS INTO FACTORS WITH GIVEN DIAMETERS OF RADIIPLESNIK J.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 4; PP. 379-387; BIBL. 32 REF.Article

ONE METHOD FOR PROVING THE IMPOSSIBILITY OF CERTAIN MOORE GRAPHS.PLESNIK J.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 4; PP. 363-376; BIBL. 16 REF.Article

THE COMPLEXITY OF DESIGNING A NETWORK WITH MINIMUM DIAMETERPLESNIK J.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 77-85; BIBL. 8 REF.Article

ON THE COMPUTATIONAL COMPLEXITY ON CENTERS LOCATING IN A GRAPHPLESNIK J.1980; APL. MAT.; ISSN 0373-6725; CSK; DA. 1980; VOL. 25; NO 6; PP. 445-452; ABS. SLO/RUS; BIBL. 16 REF.Article

REMARK ON MATCHINGS IN REGULAR GRAPHSPLESNIK J.1979; ACTA FAC. RERUM NAT. UNIV. COMENIANAE, MATH.; CSK; DA. 1979; VOL. 34; PP. 63-67; ABS. RUS; BIBL. 5 REF.Article

INFLUENCE DE LA RACE PIE NOIR DE PLAINE SUR LA COMPOSITION DE LA DEMI-CARCASSE DE JEUNES TAURILLONS A L'ENGRAISCHRENEK J; PLESNIK J.1976; POLNOHOSPODARSTVO; CESKOSL.; DA. 1976; VOL. 22; NO 1; PP. 66-72; ABS. ANGL. RUSSE; BIBL. 10 REF.Article

A note on the complexity of finding regular subgraphsPLESNIK, J.Discrete mathematics. 1984, Vol 49, Num 2, pp 161-167, issn 0012-365XArticle

ON THE COMPLEXITY OF FINDING DEGREE CONSTRAINED SUBGRAPHSPLESNIK J; WAWRUCH A.1982; ACTA MATH. UNIV. COMEN.; ISSN 0231-6986; CSK; DA. 1982; VOL. 40-41; PP. 215-218; ABS. SLO/RUS; BIBL. 9 REF.Article

On the sum of all distances in a graph or digraphPLESNIK, J.Journal of graph theory. 1984, Vol 8, Num 1, pp 1-21, issn 0364-9024Article

A construction of geodetic graphs based on pulling subgraphs homeomorphic to complete graphsPLESNIK, J.Journal of combinatorial theory. Series B. 1984, Vol 36, Num 3, pp 284-297, issn 0095-8956Article

RECHERCHE SUR L'APPLICATION DE LA CONSANGUINITE ET DE SES EFFETS SUR L'AMELIORATION DES BOVINSBELLER I; PLESNIK J.1976; SCI. WORKS RES. INST. PRODUCT. NITRA; CZECHOSL.; DA. 1976; VOL. 13; PP. 127-133; ABS. ANGL. RUSSE; BIBL. 10 REF.Article

STRONGLY GEODETIC DIRECTED GRAPHS.PLESNIK J; ZNAM S.1974; ACTA FAC. RERUM NAT. UNIV. COMENIANAE, MATH.; TCHECOSL.; DA. 1974; NO 29; PP. 29-34; BIBL. 3 REF.Article

An integer programming formulation of the Steiner problem in graphsDIANE, M; PLESNIK, J.ZOR. Zeitschrift für Operations-Research. 1993, Vol 37, Num 1, pp 107-111, issn 0340-9422Article

Embryo manipulation - present and futurePLESNIK, J; BULLA, J; BAVIN, V et al.Acta biotechnologica. 1990, Vol 10, Num 6, pp 491-493, issn 0138-4988, 3 p.Conference Paper

  • Page / 1